MUDA: A Truthful Multi-Unit Double-Auction Mechanism

نویسندگان

  • Erel Segal-Halevi
  • Avinatan Hassidim
  • Yonatan Aumann
چکیده

In a seminal paper, McAfee (1992) presented a truthful mechanism for double auctions, attaining asymptotically-optimal gain-from-trade without any prior information on the valuations of the traders. McAfee’s mechanism handles singleparametric agents, allowing each seller to sell a single unit and each buyer to buy a single unit. This paper presents a double-auction mechanism that handles multiparametric agents and allows multiple units per trader, as long as the valuation functions of all traders have decreasing marginal returns. The mechanism is priorfree, ex-post individually-rational, dominant-strategy truthful and strongly-budgetbalanced. Its gain-from-trade approaches the optimum when the market size is sufficiently large.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

Multi-unit Double Auction under Group Buying

Group buying is a business model in which a number of buyers join together to make an order of a product in a certain quantity in order to gain a desirable discounted price. Such a business model has recently received significant attention from researchers in economics and computer science, mostly due to its successful application in online businesses, such as Groupon5. This paper deals with th...

متن کامل

Truthful Combinatorial Double Auction For Combinatorial Exchanges

First-come-first-serve (FCFS) scheme is used for selling the goods in market that is a multi-million dollar industry for any popular event. But in a competitive environment is this FCFS efficient? In earlier literature it has been shown that the auction based alternative solutions using the framework of mechanism design, a sub field of game theory [18] can provide better results against FCFS in...

متن کامل

Truthful Auctions with Optimal Profit

We study the design of truthful auction mechanisms for maximizing the seller’s profit. We focus on the case when the auction mechanism does not have any knowledge of bidders’ valuations, especially of their upper bound. For the Single-Item auction, we obtain an “asymptotically” optimal scheme: for any k ∈ Z and ǫ > 0, we give a randomized truthful auction that guarantees an expected profit of Ω...

متن کامل

Truthful and Competitive Double Auctions

In this paper we consider the problem of designing a mechanism for double auctions where bidders each bid to buy or sell one unit of a single commodity. We assume that each bidder’s utility value for the item is private to them and we focus on truthful mechanisms, ones where the bidders’ optimal strategy is to bid their true utility. The profit of the auctioneer is the difference between the to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1712.06848  شماره 

صفحات  -

تاریخ انتشار 2017